Single machine SLK/DIF due window assignment problem with general job-dependent positional effect and outsourcing operations

نویسندگان

چکیده

This paper considers the SLK/DIF due window assignment problems on a single machine with general job-dependent positional effect, where actual processing time of job is subject to and effect. Production schedulers may decide outsource/reject some jobs by paying corresponding costs. Based whether accept tardiness jobs, we consider two different objectives under slack assignment, respectively. The first objective function minimize weighted sum earliness, tardiness, starting time, size, outsourcing costs, while second cost that includes size We study structural properties methods develop polynomial-time solution algorithms for considered problems. A numerical example proves advantage decision distinction between objectives.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT

In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...

متن کامل

The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times

We study the earliness-tardiness scheduling problem on a single machine with due date assignment and controllable processing times. We analyze the problem with three different due date assignment methods and two different processing time functions. For each combination of these, we provide a polynomialtime algorithm to find the optimal job sequence, due date values and resource allocation minim...

متن کامل

Single Machine Common Due Date with Job Dependent Earliness and Tardiness Penalties Problem Using Neural Network

We consider the problem of scheduling of n jobs to minimize the total earliness and tardiness penalty. The scheduling objective is to minimize the sum of job dependent earliness and tardiness penalties.. After determining the scheduling for single machine common due date, using neural network, the result shows that the neural network solution performs very well.

متن کامل

Due-Window Assignment Scheduling with Variable Job Processing Times

We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost funct...

متن کامل

Note on "Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity"

Article history: Received 19 November 2012 Received in revised form 8 May 2013 Accepted 22 August 2013 Available online 31 August 2013

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rairo-operations Research

سال: 2023

ISSN: ['1290-3868', '0399-0559']

DOI: https://doi.org/10.1051/ro/2023020